Provable Advantage for Quantum Strategies in Random Symmetric XOR Games
نویسندگان
چکیده
Non-local games are widely studied as a model to investigate the properties of quantum mechanics as opposed to classical mechanics. In this paper, we consider a subset of non-local games: symmetric XOR games of n players with 0-1 valued questions. For this class of games, each player receives an input bit and responds with an output bit without communicating to the other players. The winning condition only depends on XOR of output bits and is constant w.r.t. permutation of players. We prove that for almost any n-player symmetric XOR game the entangled value of the game is Θ (√ lnn n/4 ) adapting an old result by Salem and Zygmund on the asymptotics of random trigonometric polynomials. Consequently, we show that the classical-quantum gap is Θ( √ lnn) for almost any symmetric XOR game. 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity
منابع مشابه
Advantage of Quantum Strategies in Random Symmetric XOR Games
Non-local games are known as a simple but useful model which is widely used for displaying nonlocal properties of quantum mechanics. In this paper we concentrate on a simple subset of non-local games: multiplayer XOR games with 1-bit inputs and 1-bit outputs which are symmetric w.r.t. permutations of players. We look at random instances of non-local games from this class. We prove a tight bound...
متن کاملQuantum Strategies Are Better Than Classical in Almost Any XOR Game
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1− o(1) fraction of all 2-player XOR games.
متن کاملNonlocal Quantum XOR Games for Large Number of Players
Nonlocal games are used to display differences between classical and quantum world. In this paper, we study nonlocal games with a large number of players. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with onebit input per player, a subclass of nonlocal games. We illustrate those methods on the example of the N-player game (due to Ardehali [...
متن کاملAlgorithms, Bounds, and Strategies for Entangled XOR Games
We study the complexity of computing the commuting-operator value ω of entangled XOR games with any number of players. We introduce necessary and sufficient criteria for an XOR game to have ω = 1, and use these criteria to derive the following results: 1. An algorithm for symmetric games that decides in polynomial time whether ω = 1 or ω < 1, a task that was not previously known to be decidable...
متن کاملMultiplayer Xor Games and Quantum Communication Complexity with Clique-wise Entanglement
XOR games are a simple computational model with connections to many areas of complexity theory including interactive proof systems, hardness of approximation, and communication complexity. Perhaps the earliest use of XOR games was in the study of quantum correlations, as an experimentally realizable setup which could demonstrate non-local effects as predicted by quantum mechanics. XOR games als...
متن کامل